Previous | 
Home
Section: Partnerships and Cooperations
International Initiatives
Inria International Labs
-
Anne-Marie Kermarrec has been scientific collaborator at EPFL, Lausanne, since February 2014.
-
Anne-Marie Kermarrec has been the scientific coordinator of the EPFL/Inria International Lab since February 2015.
-
Anne-Marie Kermarrec organized the First EPFL/Inria Workshop, Lausanne, January 2015.
Inria Associate Teams not involved in an Inria International Labs
RADCON
-
Title: Randomized Algorithms for Distributed Computing and Networks
-
International Partner (Institution - Laboratory - Researcher):
-
See also: http://www.irisa.fr/asap/radcon
-
Over recent years, computing systems have seen a massive increase in parallelism and interconnectivity. Peer-to-peer systems, ad-hoc networks, sensor networks, or the "cloud” are based on highly connected and volatile networks. Individual nodes such as cell phones, desktop computers or high performance computing systems rely on parallel processing power achieved through multiple processing units. To exploit the power of massive networks or multiple processors, algorithms must cope with the scale and asynchrony of these systems, and their inherent instability, e.g., due to node, link, or processor failures. In this research project we explore randomized algorithms for large-scale networks of distributed systems, and for shared memory multi-processor systems.
For large-scale networks, decentralized gossip protocols have emerged as a standard approach to achieving fault-tolerant communication between nodes with simple and scalable algorithms. We will devise new gossip protocols for various complex distributed tasks, and we will explore the power and limits of gossip protocols in various settings.
For shared memory systems, randomized algorithms have proved extremely useful to deal with asynchrony and failures. Sometimes probabilistic algorithms provide the only solution to a problem; sometimes they are more efficient; sometimes they are simply easier to implement. We will devise efficient algorithms for some of the fundamental problems of shared memory computing, such as mutual exclusion, renaming, and consensus.